n = int(input())
d = []
for i in range(n):
a = input()
d+=[a]
s = 0
w = 0
t = [ ]
for j in d:
t+=[d.index(j)]
for k in t:
if k == 0:
s+=1
elif k > 0:
w +=1
if s > w:
l = t.index(0)
print(d[l])
elif w > s:
v = t.index(max(t))
print(d[v])
Going to office | Color the boxes |
Missing numbers | Maximum sum |
13 Reasons Why | Friend's Relationship |
Health of a person | Divisibility |
A. Movement | Numbers in a matrix |
Sequences | Split houses |
Divisible | Three primes |
Coprimes | Cost of balloons |
One String No Trouble | Help Jarvis! |
Lift queries | Goki and his breakup |
Ali and Helping innocent people | Book of Potion making |
Duration | Birthday Party |
e-maze-in | Bricks Game |
Char Sum | Two Strings |
Anagrams | Prime Number |